Small Furstenberg sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Furstenberg Sets for a Fractal Set of Directions

In this paper we study the behavior of the size of Furstenberg sets with respect to the size of the set of directions defining it. For any pair α, β ∈ (0, 1], we will say that a set E ⊂ R2 is an Fαβ-set if there is a subset L of the unit circle of Hausdorff dimension at least β and, for each direction e in L, there is a line segment e in the direction of e such that the Hausdorff dimension of t...

متن کامل

123-127 Furstenberg

for STDs and HIV.4 Though programs vary somewhat in their specific goals, most share the same premise: Expanded condom availability will increase the proportion of protected sexual encounters, particularly when it is accompanied by education and information about safer sex. Opponents have responded that distributing condoms in a school will legitimate and thus increase the prevalence of sexual ...

متن کامل

Inverting the Furstenberg correspondence

Given a sequence of sets An ⊆ {0, . . . , n − 1}, the Furstenberg correspondence principle provides a shift-invariant measure on 2 that encodes combinatorial information about infinitely many of the An’s. Here it is shown that this process can be inverted, so that for any such measure, ergodic or not, there are finite sets whose combinatorial properties approximate it arbitarily well. The finit...

متن کامل

Furstenberg Families and Sensitivity

We introduce and study some concepts of sensitivity via Furstenberg families. A dynamical system X, f is F-sensitive if there exists a positive ε such that for every x ∈ X and every open neighborhood U of x there exists y ∈ U such that the pair x, y is not F-ε-asymptotic; that is, the time set {n : d f x , f y > ε} belongs to F, where F is a Furstenberg family. A dynamical system X, f is F1, F2...

متن کامل

New Examples of Complete Sets, with Connections to a Diophantine Theorem of Furstenberg

A set A ⊆ N is called complete if every sufficiently large integer can be written as the sum of distinct elements of A. In this paper we present a new method for proving the completeness of a set, improving results of Cassels (’60), Zannier (’92), Burr, Erdős, Graham, and Li (’96), and Hegyvári (’00). We also introduce the somewhat philosophically related notion of a dispersing set and refine a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2013

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2012.11.001